// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	stack<int> s;
	int t,n,sum;
	cin>>t;
	while(t--)
	{
		//int n;
		cin>>n;
		sum=1;
		int a[n+1],b[n+1];
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
		}
		for(int i=1;i<=n;i++)
		{
			cin>>b[i];
		}
		for(int i=1;i<=n;i++)
		{
			s.push(a[i]);
			while(s.top()==b[sum])
			{
				s.pop();
				sum++;
				if(s.empty())break;
			}
		}
		if(s.empty())cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
		while(!s.empty())s.pop();
	}
	return 0;
}
